Alexander polynomial and spanning trees
نویسندگان
چکیده
Inspired by the combinatorial constructions in earlier work of authors that generalized classical Alexander polynomial to a large class spatial graphs with balanced weight on edges, we show value evaluated at [Formula: see text] gives weighted number spanning trees graph.
منابع مشابه
Polynomial Representation for the Expected Length of Minimal Spanning Trees∗
In this paper, we investigate the polynomial integrand of an integral formula that yields the expected length of the minimal spanning tree of a graph whose edges are uniformly distributed over the interval [0, 1]. In particular, we derive a general formula for the coefficients of the polynomial and use it to express the first few coefficients in terms of the structure of the underlying graph; e...
متن کاملNetworks and Spanning Trees
In 1857 Arthur Cayley (1821–1895) published a paper [9] that introduces the term “tree” to describe the logical branching that occurs when iterating the fundamental process of (partial) differentiation. When discussing the composition of four symbols that involve derivatives, Cayley writes “But without a more convenient notation, it would be difficult to find [their] corresponding expressions ....
متن کاملSpanning Trees and Spanners
We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.
متن کاملThe Alexander Polynomial for Tangles
WExpand@expr_D := Expand@expr . w_W ¦ Signature@wD * Sort@wDD; WM@___, 0, ___D = 0; a_ ~WM~ b_ := WExpandADistribute@a ** bD . Ic1_. * w1_WM ** Ic2_. * w2_WM ¦ c1 c2 Join@w1, w2D E; WM@a_, b_, c__D := a ~WM~ WM@b, cD; IM@8<, expr_D := expr; IM@i_, w_WD := If@MemberQ@w, iD, -H-1L^Position@w, iD@@1, 1DD DeleteCases@w, iD, 0D; IM@8is___, i_<, w_WD := IM@8is<, IM@i, wDD; IM@is_List, expr_D := exp...
متن کاملSpanning Trees in 2-trees
A spanning tree of a graph G is a connected acyclic spanning subgraph of G. We consider enumeration of spanning trees when G is a 2-tree, meaning that G is obtained from one edge by iteratively adding a vertex whose neighborhood consists of two adjacent vertices. We use this construction order both to inductively list the spanning trees without repetition and to give bounds on the number of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics
سال: 2021
ISSN: ['1793-6519', '0129-167X']
DOI: https://doi.org/10.1142/s0129167x21500737